Ramsey-minimal saturation numbers for matchings
نویسندگان
چکیده
منابع مشابه
Ramsey-minimal saturation numbers for matchings
Given a family of graphs F , a graph G is F-saturated if no element of F is a subgraph of G, but for any edge e in G, some element of F is a subgraph of G + e. Let sat(n,F) denote the minimum number of edges in an F-saturated graph of order n, which we refer to as the saturation number or saturation function of F . If F = {F}, then we instead say that G is F -saturated and write sat(n, F ). For...
متن کاملSaturation numbers for families of Ramsey-minimal graphs
Given a family of graphs F , a graph G is F-saturated if no element of F is a subgraph of G, but for any edge e in G, some element of F is a subgraph of G + e. Let sat(n,F) denote the minimum number of edges in an F -saturated graph of order n. For graphs G,H1, . . . , Hk, we write that G → (H1, . . . , Hk) if every k-coloring of E(G) contains a monochromatic copy of Hi in color i for some i. A...
متن کاملRainbow Ramsey Numbers of Stars and Matchings
Expanding on a recent definition by Bialostocki and Voxman, we define the rainbow ramsey number RR(G1, G2) of two graphs G1 and G2 to be the minimum integer N such that any edge-coloring of the complete graph KN with any number of colors must contain either a copy of G1 with every edge the same color or a copy of G2 with every edge a different color. This number is well-defined if G1 is a star ...
متن کاملRamsey Numbers of Connected Clique Matchings
We determine the Ramsey number of a connected clique matching. That is, we show that if G is a 2-edge-coloured complete graph on (r2− r− 1)n− r+ 1 vertices, then there is a monochromatic connected subgraph containing n disjoint copies of Kr for n sufficiently large. This number of vertices cannot be reduced.
متن کاملOrdered Ramsey numbers of loose paths and matchings
For a k-uniform hypergraph G with vertex set {1, . . . , n}, the ordered Ramsey number ORt(G) is the least integer N such that every t-coloring of the edges of the complete k-uniform graph on vertex set {1, . . . , N} contains a monochromatic copy of G whose vertices follow the prescribed order. Due to this added order restriction, the ordered Ramsey numbers can be much larger than the usual gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2014
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.12.024